Using ω-circulant matrices for the preconditioning of Toeplitz systems
نویسندگان
چکیده
Toeplitz systems can be solved efficiently by using iterative methods such as the conjugate gradient algorithm. If a suitable preconditioner is used, the overall cost of the method is O(n logn) arithmetic operations. Circulant matrices are frequently employed for the preconditioning of Toeplitz systems. They can be chosen as preconditioners themselves, or they can be used for the computation of approximate inverses. In this article, we take the larger class of ω-circulant matrices instead of the well-known circulants to extend preconditioners of both types. This extension yields an additional free parameter ω which can be chosen in a way that speeds up convergence of the conjugate gradient method. The additional computational effort arising from the use of ω-circulant instead of circulant matrices is low.
منابع مشابه
The structured distance to normality of Toeplitz matrices with application to preconditioning
A formula for the distance of a Toeplitz matrix to the subspace of {e}-circulant matrices is presented, and applications of {e}-circulant matrices to preconditioning of linear systems of equations with a Toeplitz matrix are discussed. Copyright c © 2006 John Wiley & Sons, Ltd. key words: Toeplitz matrix, circulant matrix, {e}-circulant, matrix nearness problem, distance to normality, preconditi...
متن کاملA Preconditioned MINRES Method for Nonsymmetric Toeplitz Matrices
Circulant preconditioners that cluster eigenvalues are well established for linear systems involving symmetric positive definite Toeplitz matrices. For these preconditioners rapid convergence of the preconditioned conjugate gradient method is guaranteed. Since circulant preconditioners can be applied quickly using the fast Fourier transform, preconditioned CG with circulant preconditioning is e...
متن کاملFast superoptimal preconditioning of multiindex Toeplitz matrices
In this article three well-known methods of circulant preconditioning of finite multiindex Toeplitz linear systems, that is linear systems indexed by integers i1, . . ., id with 0 is < ns (s = 1, . . ., d), are studied in detail. A general algorithm for the construction of the so-called superoptimal preconditioner is also given and it is shown that this procedure requires O(n1 · · · nd log(n1 ·...
متن کاملPreconditioning Techniques for Diagonal-times-Toeplitz Matrices in Fractional Diffusion Equations
The fractional diffusion equation is discretized by an implicit finite difference scheme with the shifted Grünwald formula, which is unconditionally stable. The coefficient matrix of the discretized linear system is equal to the sum of a scaled identity matrix and two diagonal-times-Toeplitz matrices. Standard circulant preconditioners may not work for such Toeplitz-like linear systems. The mai...
متن کاملIterative Methods for Toeplitz-like Matrices
In this paper we will give a survey on iterative methods for solving linear equations with Toeplitz matrices. We introduce a new class of Toeplitz matrices for which clustering of eigenvalues and singular values can be proved. We consider optimal (ω)circulant preconditioners as a generalization of the circulant preconditioner. For positive definite Toeplitz matrices, especially in the real case...
متن کامل